Hamilton cycles in split graphs with large minimum degree

نویسندگان

Le Xuan Hung

Ngo Dac Tan

چکیده

A graph G is called a split graph if the vertex-set V of G can be partitioned into two subsets V1 and V2 such that the subgraphs of G induced by V1 and V2 are empty and complete, respectively. In this paper, we characterize hamiltonian graphs in the class of split graphs with minimum degree δ at least |V1| − 2.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Perfect Matchings, Tilings and Hamilton Cycles in Hypergraphs

This thesis contains problems in finding spanning subgraphs in graphs, such as, perfect matchings, tilings and Hamilton cycles. First, we consider the tiling problems in graphs, which are natural generalizations of the matching problems. We give new proofs of the multipartite Hajnal-Szemerédi Theorem for the tripartite and quadripartite cases. Second, we consider Hamilton cycles in hypergraphs....

متن کامل

Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree

We study the number of edge-disjoint Hamilton cycles one can guarantee in a sufficiently large graph G on n vertices with minimum degree δ = (1/2+α)n. For any constant α > 0, we give an optimal answer in the following sense: let regeven(n, δ) denote the degree of the largest even-regular spanning subgraph one can guarantee in a graph G on n vertices with minimum degree δ. Then the number of edg...

متن کامل

Spectral analogues of Erdős’ and Moon-Moser’s theorems on Hamilton cycles

In 1962, Erdős gave a sufficient condition for Hamilton cycles in terms of the vertex number, edge number, and minimum degree of graphs which generalized Ore’s theorem. One year later, Moon and Moser gave an analogous result for Hamilton cycles in balanced bipartite graphs. In this paper we present the spectral analogues of Erdős’ theorem and Moon-Moser’s theorem, respectively. Let Gk n be the ...

متن کامل

An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three

We describe an algorithm for finding Hamilton cycles in random graphs. Our model is the random graph G = Gδ≥3 n,m. In this model G is drawn uniformly from graphs with vertex set [n], m edges and minimum degree at least three. We focus on the case where m = cn for constant c. If c is sufficiently large then our algorithm runs in O(n) time and succeeds w.h.p.

متن کامل